Belief propagation for minimum weight many-to-one matchings in the random complete graph
نویسندگان
چکیده
منابع مشابه
Belief propagation for minimum weight many-to-one matchings in the random complete graph
In a complete bipartite graph with vertex sets of cardinalities n and n′, assign random weights from exponential distribution with mean 1, independently to each edge. We show that, as n → ∞, with n′ = dn/αe for any fixed α > 1, the minimum weight of many-to-one matchings converges to a constant (depending on α). Many-to-one matching arises as an optimization step in an algorithm for genome sequ...
متن کاملBelief propagation for optimal edge-cover in the random complete graph
We apply the objective method of Aldous to the problem of finding the minimum-cost edge cover of the complete graph with random independent and identically distributed edge costs. The limit, as the number of vertices goes to infinity, of the expected minimum cost for this problem is known via a combinatorial approach of Hessler and Wästlund. We provide a proof of this result using the machinery...
متن کاملMeasuring Musical Rhythm Similarity: Edit Distance versus Minimum-Weight Many-to-Many Matchings
Musical rhythms are represented as binary symbol sequences of sounded and silent pulses of unit-duration. A measure of distance (dissimilarity) between a pair of rhythms commonly used in music information retrieval, music perception, and musicology is the edit (Levenshtein) distance, defined as the minimum number of symbol insertions, deletions, and substitutions needed to transform one rhythm ...
متن کاملThe Longest Minimum-Weight Path in a Complete Graph
We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variables. We show that the longest of these minimum-weight paths has about α logn edges where α ≈ 3.5911 is the unique solution of the equation α logα − α = 1. This answers a question left open by Janson [8].
متن کاملMany-to-One Packed Routing via Matchings
In this paper we study the packet routing problem under the matching model proposed by Alon, Chung and Graham 1]. We extend the model to allow more than one packet per origin and destination node. We give tight bounds for the many-to-one routing number for complete graphs, complete bipartite graphs and linear arrays. We also present an eecient algorithm for many-to-one routing on an trees (and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2014
ISSN: 1083-6489
DOI: 10.1214/ejp.v19-3491